Algorithms for sparse Gaussian elimination with partial pivoting
نویسندگان
چکیده
منابع مشابه
Parallel Sparse Gaussian Elimination with Partial Pivoting and 2-d Data Mapping Parallel Sparse Gaussian Elimination with Partial Pivoting and 2-d Data Mapping Abstract Parallel Sparse Gaussian Elimination with Partial Pivoting and 2-d Data Mapping
Sparse Gaussian elimination with partial pivoting is a fundamental algorithm for many scientiic and engineering applications, but it is still an open problem to develop a time and space eecient algorithm on distributed memory machines. In this thesis, we present an asynchronous algorithm which incorporates static symbolic factorization, nonsymmetric L/U supernode partitioning and supern-ode ama...
متن کاملSymbolic and Exact Structure Prediction for Sparse Gaussian Elimination with Partial Pivoting
In this paper we consider two structure prediction problems of interest in Gaussian elimination with partial pivoting of sparse matrices. First, we consider the problem of determining the nonzero structure of the factors L and U during the factorization. We present an exact prediction of the structure, that identifies some numeric cancellations appearing during Gaussian elimination. The numeric...
متن کاملSystolic Gaussian Elimination over GF(p) with Partial Pivoting
We propose a systolic architecture for the triangularization via the Gauss elimination algorithm of large dense n x n matrices over GF@), where p is a prime number. The solution of large dense linear systems over GF(p) is the major computational step in various algorithms issued from arithmetic number theory and computer algebra. The proposed architecture implements the elimination with partial...
متن کاملGaussian Elimination with Randomized Complete Pivoting
Gaussian elimination with partial pivoting (GEPP) has long been among the most widely used methods for computing the LU factorization of a given matrix. However, this method is also known to fail for matrices that induce large element growth during the factorization process. In this paper, we propose a new scheme, Gaussian elimination with randomized complete pivoting (GERCP) for the efficient ...
متن کاملNumerically Safe Gaussian Elimination with No Pivoting
Gaussian elimination with partial pivoting is performed routinely, millions times per day around the world, but partial pivoting (that is, row interchange of an input matrix) is communication intensive and has become the bottleneck of the elimination algorithm in the present day computer environment, in both cases of matrices of large and small size. Gaussian elimination with no pivoting as wel...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Mathematical Software
سال: 1978
ISSN: 0098-3500,1557-7295
DOI: 10.1145/356502.356494